Computation of Smoothed Local Symmetries on a MIMD Architecture

نویسنده

  • Mark W. Wright
چکیده

An algorithm is presented to compute smoothed local symmetries on a MIMD architecture. Based on Brady and Scott's Connection Machine algorithm, it is adapted to reduce the synchronisation and communication overheads involved. Using an evidence accumulation approach similar to the Hough transform for circle detection, this algorithm can compute both local and rotational symmetries simultaneously. Implementation on an array of transputers is described and the results discussed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compiling Geometric Paradigms through Local Communications

This paper presents a compiling technique to generate parallel code with explicit local communications for a mesh-connected distributed memory, MIMD architecture. Our compiling technique works for the geometric paradigm of parallel computation, i.e. a data-parallel paradigm where array data structures are partitioned and assigned to a set of processing nodes, which, to perform their identical t...

متن کامل

Compiling Data - Parallel Paradigms through

This paper presents a compiling technique to generate parallel code with explicit local communications for a mesh-connected distributed memory, MIMD architecture. Our compiling technique works for the geometric paradigm of parallel computation, i.e. a data-parallel paradigm where array data structures are partitioned and assigned to a set of processing nodes, which, to perform their identical t...

متن کامل

Exploiting mixed-mode parallelism for matrix operations on the HERA architecture through reconfiguration

Recent advances in multi-million-gate platform FPGAs have made it possible to design and implement complex parallel systems on a programmable chip (PSOPCs) that also incorporate hardware floating-point units (FPUs). These options take advantage of resource reconfiguration. In contrast to the majority of the FPGA community that still employs reconfigurable logic to develop algorithm-specific cir...

متن کامل

Intelligent Parallel Volume Rendering Using View Coherence on Mimd Architectures

Although volume rendering is a powerful computer graphics technique for visualizing data represented at three spatial dimensions, it is computationally intensive. Parallel Computing represents the most promising solutions for computationally expensive problems. This paper aims to introduce some new concepts and proposes a new method for parallel volume rendering on MIMD architectures. The metho...

متن کامل

Implementing Image Processing Algorithms for the Epiphany Many-Core Coprocessor with Threaded MPI

The Adapteva Epiphany MIMD architecture is a scalable, two-dimensional (2D) array of RISC cores with minimal uncore functionality connected with a fast 2D mesh network on a chip (NoC). We apply a threaded MPI programming model for image processing kernels including a 2D Fast Fourier Transform (FFT) with high-pass filter for edge detection; local operators for Gaussian image smoothing; and a Sob...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1991